problem of the seven bridges of Königsberg

См. также в других словарях:

• Seven Bridges of Königsberg — The Seven Bridges of Königsberg is a famous historical problem in mathematics. Its 1736 negative resolution by Leonhard Euler laid the foundations of graph theory and presaged the idea of topology. Description The city of Königsberg in Prussia… …   Wikipedia

• Seven Bridges of Königsberg/key — Solution to the variant Königsberg = Answer Solution Reduce the city, as before, to a graph. Color each node. As in the classic problem, no Euler walk is possible; coloring does not affect this. All four nodes have an odd number of edges. The… …   Wikipedia

• Königsberg — Infobox Settlement official name = Königsberg in Preußen settlement type = City nickname = imagesize = image caption = Königsberg Castle before World War I image mapsize = map caption = mapsize1 = map caption1 = subdivision type = Former Country… …   Wikipedia

• Königsberg (disambiguation) — Königsberg (German for kings mountain ) may refer to several places, many of them not part of Germany or Austria anymore:Places* Königsberg in Preußen, founded in 1256 and, until 1945, capital of East Prussia (since, Kaliningrad in Russia) **… …   Wikipedia

• Königsberg bridge problem — a mathematical problem in graph theory, solved by Leonhard Euler, to show that it is impossible to cross all seven bridges of the Prussian city of Königsberg in a continuous path without recrossing any bridge. * * * ▪ mathematics  a recreational… …   Universalium

• The Blitz — London Blitz redirects here. For the London based American football team, see London Blitz (American football). For other uses, see Blitz (disambiguation). The Blitz Part of Second World War, Home Front …   Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• Königsberg bridge problem — a mathematical problem in graph theory, solved by Leonhard Euler, to show that it is impossible to cross all seven bridges of the Prussian city of Königsberg in a continuous path without recrossing any bridge …   Useful english dictionary

• Thinking outside the box — For the album by Skream, see Outside the Box (Skream album). Thinking outside the box (sometimes erroneously called thinking out of the box or thinking outside the square ) is to think differently, unconventionally, or from a new perspective.… …   Wikipedia

• Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 …   Wikipedia

• Hapgood — is a play by Tom Stoppard, first produced in 1988. It is mainly about espionage, focusing on a British female spymaster (Hapgood) and her juggling of career and motherhood. The play also makes reference to quantum mechanics, including Niels Bohr… …   Wikipedia